Homological algebra里的经典导出函子理论, 主要抄书参考 gtm4, 这一节暂时没有涉及到导出函子的计算理论, 以后有空补上. (;′⌒`)
Left Derived Functor
Definition 1. For an object in abelian category and its projective resolution , let be an addictive functor. We define the left derived functor of ,
$$TP: \quad \cdots \to TP_{n}\to TP_{n-1}\to\cdots\to TP_{0}\to 0$$
From the Revolution we know for , the morphism induces , where , are projective resolution of , respectively. So when applying , the left derived functor is indeed a functor.
Now we verify is well-defined, i.e. for two projective resolution of , there’s an isomorphism .
Since the two projective resolutions are of the same homotopy type, i.e. and with , . Then , gives homotopy equivalence between and since is addictive. Since homotopic morphisms will give the same homology morphisms, we have , i.e. .
Definition 2. An covariant functor is left eact if for every exact sequence , the sequence is exact.
Definition 3. An covariant functor is right eact if for every exact sequence , the sequence is exact.
Definition 4. An covariant functor is eact if it is left and right exact.
Theorem 1. Let be a right exact functor, then and are naturally isomorphic.
Proof
Proof. For a projective resolution of , applying to , we have exact. So . The naturality is obvious. ◻
Proposition 1. The functor is an addictive functor.
Proof
Proof. Omitted. ◻
Theorem 2. Let be an exact sequence with projective. If is right exact, then the sequence
$$0\to L_{q}TA\to TK_{q}\xrightarrow{Tf}TP_{q-1}$$
is exact.
Proof
Proof. Consider a projective resolution of . Then we get an projective resolution of by
Since is right exact, we consider the diagram
By snake lemma, we get an exact sequence
By exactness, . ◻
Using duality, we have a similar theorem:
Theorem 3. Let be an exact sequence, where are projective. If is left exact, then the sequence
$$T(P_{q})\to T(\mathrm{Im}d_{q})\to L_{q-1}T(A)\to 0$$
is exact.
Right Derived Functor
Definition 5. For an object in abelian category and its injective resolution , let be an addictive functor. We define the right derived functor of ,
$$TI: \quad 0\to TI_{0}\to\cdots\to TI_{q}\to TI_{q+1}\to \cdots$$
Similarly, we can prove is a well-defined functor.
Theorem 4. If is left exact, then is naturally isomorphic to .
Proof
Proof. Omitted. ◻
If we choose to be a controvariant functor, we use the projective resolution of to make a cochain. Then we will have similar proposition as left derived functor.
Derived Long Exact Sequence
From the long exact sequence theorem, we can derive the following theorems.
Lemma 1 (Horseshoe). For exact sequence and projective resolution , of and respectively. There exists projective resolution of s.t. the following diagram commutes and rows exact.
Proof
Proof. Let , we have also a projective and acyclic chain complex. Then is an exact sequence.
We use induction to build .
First for :
By projectivity, we can find with . Since is a direct sum and
we have a unique morphism . Using the snake lemma we can conclude exact.
Suppose for , the induction step is exactly the same as . ◻
Now we give the long exact sequence theorem of left derived functor.
Theorem 5. Let be a covariant addictive functor. is a short exact sequence. Then there are s.t. the following sequence exact
Proof
Proof. Applying lemma above to we get a commtative dagram with exact rows:
Since , is addictive, we have exact. Using long exact sequence theorem we have the long exact sequence
◻
Let be a natural transformation, we can define morphism . Then induces a natural transformation .
Theorem 6. Let be a natural transformation. The diagram is commtative with exact rows
Then the following diagram commutes with exact rows:
1.
2.
Proof
Proof. Omitted. Using generalized snake lemma. ◻
Definition 6. We say a sequence of functor exact on projectives if for every projective objects , the sequence is exact.
Theorem 7. Let the sequence be exact on projectives. Then for every object , there are morphisms s.t. there’s long exact sequence
Proof
Proof. Omitted. ◻
Theorem 8. Let be a morphism and
be a commtative diagram with exact rows on projectives. Then the following diagrams commtutes with exact rows:
1.
2.
Proof
Proof. Omitted. Using generalized snake lemma. ◻